Vertex-weighted Wiener polynomials for composite graphs
نویسندگان
چکیده
منابع مشابه
Some results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملWiener Number of Vertex-weighted Graphs and a Chemical Application
The Wiener number W (G) of a graph G is the sum of distances between all pairs of vertices of G. If (G,w) is a vertex-weighted graph, then the Wiener number W (G,w) of (G,w) is the sum, over all pairs of vertices, of products of weights of the vertices and their distance. For G being a partial binary Hamming graph, a formula is given for computing W (G,w) in terms of a binary Hamming labeling o...
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملWiener Polynomials for Steiner Distance of Graphs
In this paper, the Wiener polynomials Wn(G;x) for some special graphs G including path graphs and cycle graphs are obtained. Moreover, for vertex-disjoint connected graphs G1 and G2, formulas for the Wiener polynomials of Steiner n-distance of compound graphs G1•G2 and G1:G2 are obtained in terms of those polynomials for G1and G2.
متن کاملa note on vertex-edge wiener indices of graphs
the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2008
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.15.895